ASPHERICAL LABELLED ORIENTED TREES AND KNOTS
نویسندگان
چکیده
منابع مشابه
Monotonically labelled Motzkin trees
Consider a rooted tree structure the nodes of which have been labelled monotonically by elements of { 1, 2, . . .,k}, which means that any sequence connecting the root of the tree with a leaf is weakly monotone . For fixed k asymptotic equivalents of the form CA gA °n; 2 (n --oo) to the numbers of such tree structures with n nodes are obtained for the family of extended unary-binary trees (i .e...
متن کاملPattern Avoidance in Labelled Trees
We discuss a new notion of pattern avoidance motivatedby operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words, permutations, colouredpermutations, etc. ThenotionofWilf equivalence for patterns in permutations admits a straightforward generalisation for (sets of) tree patt...
متن کاملEnumeration of Some Labelled Trees
In this paper we are interesting in the enumeration of rooted labelled trees according to the relationship between the root and its sons. Let Tn;k be the family of Cayley trees on n] such that the root has exactly k smaller sons. In a rst time we give a bijective proof of the fact that jTn+1;kj = ? n k n n?k. Moreover, we use the family Tn+1;0 of Cayley trees for which the root is smaller than ...
متن کاملA multivariate hook formula for labelled trees
Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The righthand side can be written nicely as a product of linear factors. We study two specializations of this new formula, including Cayley’s enumeration of trees with respect to vertex deg...
متن کاملSimilarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unordered or ordered and not necessarily carrying the same labels. The trees to be compared are first represented in the form of matrices whose entries are in the interval [O,1] and the actual comparison strategy then relies...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 2001
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091599000474